Optimal job splitting on a multi‐slot machine with applications in the printing industry

In this article, we define a scheduling/packing problem called the Job Splitting Problem, motivated by the practices in the printing industry. There are n types of items to be produced on an m‐slot machine. A particular assignment of the types to the slots is called a “run” configuration and requires a setup cost. Once a run begins, the production continues according to that configuration and the “length” of the run represents the quantity produced in each slot during that run. For each unit of production in excess of demand, there is a waste cost. Our goal is to construct a production plan, i.e., a set of runs, such that the total setup and waste cost is minimized. We show that the problem is strongly NP‐hard and propose two integer programming formulations, several preprocessing steps, and two heuristics. We also provide a worst‐case bound for one of the heuristics. Extensive tests on real‐world and randomly generated instances show that the heuristics are both fast and effective, finding near‐optimal solutions. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

基于层裂机理的弹体侵彻混凝土的工程模型

以斜侵彻过程中的终点弹道为研究对象,基于动态球形空腔膨胀理论给出的阻力函数理论公式和开坑阶段的表面层裂机理,建立了能够综合考虑弹头形状、开坑区深度的斜侵彻深度预测模型,并进一步推导了能够适用不同弹头形状的弹体过载时程曲线计算公式。预测模型得到的侵彻深度和过载与试验结果吻合较好。研究结果可为弹体与混凝土靶的斜侵彻弹道分析和弹丸头部设计提供一定帮助。     

基于层裂机理的弹体侵彻混凝土的终点弹道研究

基于动态球形空腔膨胀理论给出的阻力函数理论公式和开坑阶段的表面层裂机理,建立了能够综合考虑弹头形状、开坑区深度的斜侵彻深度预测模型,并进一步推导了能够适用不同弹头形状的弹体过载时程曲线计算公式。预测模型得到的侵彻深度和过载与试验结果吻合较好。研究结果可为弹体与混凝土靶的斜侵彻弹道分析和弹丸头部设计提供一定帮助。     

芳纶纤维增强塑料筋混凝土劈裂粘结应力的理论分析

基于Tepfers受均匀内压力作用的厚壁圆筒力学模型和混凝土材料的软化性能,视芳纶纤维增强塑料筋为横观各向同性材料,同时考虑了芳纶纤维增强塑料筋与混凝土之间的摩擦力和机械咬合力,建立了芳纶纤维增强塑料筋与混凝土之间劈裂粘结应力的计算方法,其理论值与试验值符合较好。     

Selecting review periods for a coordinated multi‐item inventory model with staggered deliveries

Consider an N‐item, periodic review, infinite‐horizon, undiscounted, inventory model with stochastic demands, proportional holding and shortage costs, and full backlogging. For 1 ≤ j ≤ N, orders for item j can arrive in every period, and the cost of receiving them is negligible (as in a JIT setting). Every T_j periods, one reviews the current stock level of item j and decides on deliveries for each of the next T_j periods, thus incurring an item‐by‐item fixed cost k_j. There is also a joint fixed cost whenever any item is reviewed. The problem is to find review periods T₁, T₂, …, T_N and an ordering policy satisfying the average cost criterion. The current article builds on earlier results for the single‐item case. We prove an optimal policy exists, give conditions where it has a simple form, and develop a branch and bound algorithm for its computation. We also provide two heuristic policies with O(N) computational requirements. Computational experiments indicate that the branch and bound algorithm can handle normal demand problems with N ≤ 10 and that both heuristics do well for a wide variety of problems with N ranging from 2 to 200; moreover, the performance of our heuristics seems insensitive to N. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48:430–449, 2001